#include <iostream>
#include <cstdio>
#include <stack>
#include <stdlib.h>

typedef int ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
    ElementType Data;
    BinTree Left;
    BinTree Right;
};

void PreorderTraversal( BinTree BT ); /* 先序遍历，由裁判实现，细节不表 */
void InorderTraversal( BinTree BT );  /* 中序遍历，由裁判实现，细节不表 */

BinTree Insert( BinTree BST, ElementType X );
BinTree Delete( BinTree BST, ElementType X );
Position Find( BinTree BST, ElementType X );
Position FindMin( BinTree BST );
Position FindMax( BinTree BST );

int main()
{
    BinTree BST, MinP, MaxP, Tmp;
    ElementType X;
    int N, i;

    BST = NULL;
    scanf("%d", &N);
    for ( i=0; i<N; i++ ) {
        scanf("%d", &X);
        BST = Insert(BST, X);
    }
    printf("Preorder:"); PreorderTraversal(BST); printf("\n");
    MinP = FindMin(BST);
    MaxP = FindMax(BST);
    scanf("%d", &N);
    for( i=0; i<N; i++ ) {
        scanf("%d", &X);
        Tmp = Find(BST, X);
        if (Tmp == NULL) printf("%d is not found\n", X);
        else {
            printf("%d is found\n", Tmp->Data);
            if (Tmp==MinP) printf("%d is the smallest key\n", Tmp->Data);
            if (Tmp==MaxP) printf("%d is the largest key\n", Tmp->Data);
        }
    }
    scanf("%d", &N);
    for( i=0; i<N; i++ ) {
        scanf("%d", &X);
        BST = Delete(BST, X);
    }
    printf("Inorder:"); InorderTraversal(BST); printf("\n");

    return 0;
}
/* 你的代码将被嵌在这里 */

// From https://blog.csdn.net/qq_39339575/article/details/89852668
void InorderTraversal( BinTree BT ){
    stack<BinTree> s;
    s.push(BT);
    while(s.size() > 0){
        BinTree temp = s.top();
        while(temp) {temp = temp->Left; s.push(temp);}
        s.pop();
        if(s.size() > 0){
			temp = s.top();
		    s.pop();
            cout  <<  temp->Data << " ";
            s.push(temp->Right);
        }
    }
}
void PreorderTraversal( BinTree BT ){
    stack<BinTree> s;
    s.push(BT);
    while(s.size() > 0){
        BinTree temp = s.top();
        while(temp) {   cout <<( temp->Data)<< " ";  temp = temp->Left;  s.push(temp);}
        s.pop();
  
        if(s.size() > 0){
			temp = s.top();
			s.pop();
            s.push(temp->Right);
        }
    }
}
BinTree Insert( BinTree BST, ElementType X )
{
    if(BST == NULL)
    {
         BST = (BinTree)malloc(sizeof(struct TNode));
         BST->Data = X;
         BST->Left = NULL;
         BST->Right = NULL;
    }
    else
    {
        if(BST->Data > X)
            BST->Left = Insert(BST->Left, X);
        else
            BST->Right = Insert(BST->Right, X);
    }
    return BST;
}
BinTree Delete( BinTree BST, ElementType X )
{
    BinTree Tmp;
    if(!BST)
        printf("Not Found\n");
    else
    {
        if(BST->Data > X)
            BST->Left = Delete(BST->Left, X);
        else if(BST->Data < X)
            BST->Right = Delete(BST->Right, X);
        else
        {
            if(BST->Left && BST->Right)
            {
                Tmp = FindMin(BST->Right);
                BST->Data = Tmp->Data;
                BST->Right = Delete(BST->Right, Tmp->Data);
            }
            else
            {
                Tmp = BST;
                if(Tmp->Right)
                    BST = BST->Right;
                else
                    BST = BST->Left;
                // free(Tmp);
            }
        }
    }
    return BST;
}
BinTree Find( BinTree BST, ElementType X )
{
    if(BST==NULL)
        return NULL;
    else if(BST->Data > X)
        BST = Find(BST->Left, X);
    else if(BST->Data < X)
        BST = Find(BST->Right, X);
    else
        return BST;
}
BinTree FindMin( BinTree BST )
{
    if(BST==NULL)
        return BST;
    while(BST->Left!=NULL)
        BST = BST->Left;
    return BST;
}
BinTree FindMax( BinTree BST )
{
    if(BST==NULL)
        return BST;
    while(BST->Right!=NULL)
        BST = BST->Right;
    return BST;
}